Probabilistic while loop
نویسنده
چکیده
This AFP entry defines a probabilistic while operator based on subprobability mass functions and formalises zero-one laws and variant rules for probabilistic loop termination. As applications, we implement probabilistic algorithms for the Bernoulli, geometric and arbitrary uniform distributions that only use fair coin flips, and prove them correct and terminating with probability 1.
منابع مشابه
A Formal Approach to Probabilistic Termination
We present a probabilistic version of the while loop, in the context of our mechanised framework for verifying probabilistic programs. The while loop preserves useful program properties of measurability and independence, provided a certain condition is met. This condition is naturally interpreted as “from every starting state, the while loop will terminate with probability 1”, and we compare it...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملExpectation Invariants for Probabilistic Program Loops as Fixed Points
We present static analyses for probabilistic loops using expectation invariants. Probabilistic loops are imperative while-loops augmented with calls to random value generators. Whereas, traditional program analysis uses Floyd-Hoare style invariants to over-approximate the set of reachable states, our approach synthesizes invariant inequalities involving the expected values of program expression...
متن کاملشناسایی حلقه‌های تاج خورشید با استفاده از ممان‌های تصویر
In this paper, the method of identifying of the similar solar flux tubes from image sequence EUVI/STEREO is presented. Using the oriented coronal curved loop tracing, the loops of an image are labeled. Based on local maxima intensities, the width of loops is determined. The Zernike moments of each loop are calculated and fed to probabilistic network classifier. Also, 588 loops from STEREO are s...
متن کاملDESIGN OF MINIMUM SEEPAGE LOSS IRRIGATION CANAL SECTIONS USING PROBABILISTIC SEARCH
To ensure efficient performance of irrigation canals, the losses from the canals need to be minimized. In this paper a modified formulation is presented to solve the optimization model for the design of different canal geometries for minimum seepage loss, in meta-heuristic environment. The complex non-linear and non-convex optimization model for canal design is solved using a probabilistic sear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017